Smooth points on semi-algebraic sets
نویسندگان
چکیده
Many algorithms for determining properties of real algebraic or semi-algebraic sets rely upon the ability to compute smooth points. In this paper, we present a procedure based on computing critical points some well-chosen function that guarantees computation in each bounded connected component (real) atomic set. Our technique is intuitive principal, performs well previously difficult examples, and straightforward implement using existing numerical geometry software. The practical efficiency our approach demonstrated by solving conjecture number equilibria Kuramoto model n=4 case. We also apply method design an algorithm dimension sets, original motivation research. compare methods benchmark family.
منابع مشابه
Computing Integral Points in Convex Semi-algebraic Sets
Let Y be a convex set in IR k deened by polynomial inequalities and equations of degree at most d 2 with integer coeecients of binary length l. We show that if Y \ ZZ k 6 = ;, then Y contains an integral point of binary length ld O(k 4). For xed k, our bound implies a polynomial-time algorithm for computing an integral point y 2 Y. In particular, we extend Lenstra's theorem on the polynomial-ti...
متن کامل$r$-fuzzy regular semi open sets in smooth topological spaces
In this paper, we introduce and study the concept of $r$-fuzzy regular semi open (closed) sets in smooth topological spaces. By using $r$-fuzzy regular semi open (closed) sets, we define a new fuzzy closure operator namely $r$-fuzzy regular semi interior (closure) operator. Also, we introduce fuzzy regular semi continuous and fuzzy regular semi irresolute mappings. Moreover, we investigate the ...
متن کاملNumerically computing real points on algebraic sets
Given a polynomial system f , a fundamental question is to determine if f has real roots. Many algorithms involving the use of infinitesimal deformations have been proposed to answer this question. In this article, we transform an approach of Rouillier, Roy, and Safey El Din, which is based on a classical optimization approach of Seidenberg, to develop a homotopy based approach for computing at...
متن کاملAlgebraic boundaries of convex semi-algebraic sets
We study the algebraic boundary of a convex semi-algebraic set via duality in convex and algebraic geometry. We generalise the correspondence of facets of a polytope with the vertices of the dual polytope to general semi-algebraic convex sets. In this case, exceptional families of extreme points might exist and we characterise them semi-algebraically. We also give a strategy for computing a com...
متن کاملSemi-algebraic neighborhoods of closed semi-algebraic sets
— Given a closed (not necessarly compact) semi-algebraic set X in Rn, we construct a non-negative semi-algebraic C2 function f such that X=f−1(0) and such that for δ > 0 sufficiently small, the inclusion of X in f−1([0, δ]) is a retraction. As a corollary, we obtain several formulas for the Euler characteristic of X. Résumé. — Étant donné un ensemble semi-algébrique fermé (non nécessairement co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2023
ISSN: ['1095-855X', '0747-7171']
DOI: https://doi.org/10.1016/j.jsc.2022.09.003